High Throughput Multipliers Using Delay Equalization
نویسندگان
چکیده
منابع مشابه
Multipliers with Reduced Area and Delay Using Carry save Adders
Although redundant addition is widely used to design parallel multioperand adders for ASIC implementations, the use of redundant adders on Field Programmable Gate Arrays (FPGAs) has generally been avoided.The main reasons are the efficient implementation of carry propagate adders (CPAs) on these devices (due to their specialized carry-chain resources) as well as the area overhead of the redunda...
متن کاملBlind MIMO equalization with optimum delay using independent component analysis
Blind space–time equalization of multiuser time-dispersive digital communication channels consists of recovering the users’ simultaneously transmitted data free from the interference caused by each other and the propagation effects, without using training sequences. In scenarios composed of mutually independent non-Gaussian i.i.d. users’ signals, independent component analysis (ICA) techniques ...
متن کاملLeast-squares channel equalization performance versus equalization delay
Linear channel equalization has been a successful way to combat intersymbol interference (ISI) introduced by physical communication channels at high enough symbol rates. We consider the performance of least-squares equalizers in the single-input/multi-output (SIMO) channel context when the true channel is composed of an th-order significant part and tails of “small” leading and/or trailing term...
متن کاملPath Delay Fault Testable Modified Booth Multipliers
Testing of Modified Booth Multipliers (MBMs) with respect to path delay faults, is studied in this paper. Design modifications are proposed and a path selection method is suggested. The selected paths are Single Path Propagating – Hazard Free Robustly Testable (SPPHFRT) and based on their delays the delay along any other path of the MBM can be calculated. The number of the selected paths is imp...
متن کاملAsynchronous Multipliers with Variable-Delay Counters
Although multiplication is an intensely studied arithmetic operation and many fast algorithms and implementations are avalaible, it still represents one of the major bottlenecks of many digital systems that require intensive and fast computations. This paper presents a novel design approach based on the well-known Baugh and Wooley algorithm, particularly appealing for asynchronous implementatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2010
ISSN: 0975-8887
DOI: 10.5120/661-929